Using Remote Access Histories for Thread Scheduling in Distributed Shared Memory Systems
نویسندگان
چکیده
Sec Delta (ms) Figure 7: Optimal values of. Left: Execution time of FS-TSP for k = 2; Optimal value of is 150ms. Right: Execution time of FS-TSP for k = 3; Optimal value is 300ms. a mechanism that will optimize the migration decisions in a distributed environment supporting object oriented programming and concurrent execution. There are many apparent directions that are yet to be explored. In particular, the interaction of the rahm and the load balancing algorithm, the automatic tuning of parameters such as and the ping-pong detection sensitivity, additional stabilizing mechanisms, all require further work.A natural parallel extention of C++. Technion's laboratory for distributed-parallel computing internal document, 1996. 24 in particular the measure for a host being over-or under-loaded. Nevertheless, Figure 6 (Right) does give an idea for the importance of tuning the ping-pong detection sensitivity.
منابع مشابه
Directoryless shared memory architecture using thread migration and remote access
Distributed directory cache coherence protocols for current many-core CMPs are not only difficult and error-prone to implement and verify, but also provide suboptimal performance when a thread requires access to large amounts of data distributed across the chip: the data must be brought to the core where the thread is running, incurring delays and energy costs. In this paper, we propose an appr...
متن کاملOpenMP task scheduling strategies for multicore NUMA systems
The recent addition of task parallelism to the OpenMP shared memory API allows programmers to express concurrency at a high level of abstraction and places the burden of scheduling parallel execution on the OpenMP run time system. Efficient scheduling of tasks on modern multi-socket multicore shared memory systems requires careful consideration of an increasingly complex memory hierarchy, inclu...
متن کاملAn Evaluation of Thread Migration for Exploiting Distributed Array Locality
Thread migration is one approach to remote memory accesses on distributed memory parallel computers. In thread migration, threads of control migrate between processors to access data local to those processors, while conventional approaches tend to move data to the threads that need them. Migration approaches enhance spatial locality by making large address spaces local, but are less adept at ex...
متن کاملA Multithreaded Runtime System With Thread Migration for Distributed Memory Parallel Computing
Multithreading is very effective at tolerating the latency of remote memory accesses in distributed memory parallel computers, but does nothing to reduce the number or cost of those memory accesses. Compiler techniques and runtime approaches, such as caching remote memory accesses and prefetching, are often used to reduce the number of remote memory accesses. Another approach to reduce the numb...
متن کامل\threads: a System for the Support of Concurrent Programming". Technical Report
Many parallel applications are implemented using lightweight thread packages. The low overhead associated with user-level thread management encourages programmers to use threads to exploit ne-grain parallelism in an application. Although the overhead of explicit thread management can be very small, there is other overhead associated with lightweight threads: the time required to load data into ...
متن کامل